An Invariant-preserved Transformation of State Machines from Equations into Rewrite Rules
نویسندگان
چکیده
We present an approach to the transformation of state machines from a restricted subclass of equational theories into rewrite theories, and show the transformation preserves invariant properties. Invariantpreservation of the transformation guarantees that a counterexample that is found to an invariant by model checking a generated rewrite theory is also the counterexample to the corresponding invariant in the original equational theory. This result is fundamental to the interactive verification of computer systems’ invariants by the combination of theorem proving an equational theory of the system and model checking the generated rewrite theory.
منابع مشابه
Facilitating the Transformation of State Machines from Equations into Rewrite Rules
The multiplicity of formalisms and corresponding verification systems makes the transformation useful for interoperations among them. We have proposed an approach to the transformation of state machines from a syntax-constrained class of equational theories into rewrite theories, which can be verified by Maude’s model checking facilities. However, the efficiency of model checking generated rewr...
متن کاملCentrum Voor Wiskunde En Informatica within Arm's Reach: Compilation of Left-linear Rewrite Systems via Minimal Rewrite Systems within Arm's Reach: Compilation of Left-linear Rewrite Systems via Minimal Rewrite Systems
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM). Keywords and Phrases: minimal term rewriting systems, abstract machines, program transformations Note: Part of this w...
متن کاملAn Efficient Compiler for Weighted Rewrite Rules
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finite-state transducers (FSTs). We describe a new algorithm for compiling rewrite rules into FSTs. We show the algorithm to be simpler and more efficient than existing algorith...
متن کاملConstraint-aware Schema Transformation
Data schema transformations occur in the context of software evolution, refactoring, and cross-paradigm data mappings. When constraints exist on the initial schema, these need to be transformed into constraints on the target schema. Moreover, when high-level data types are refined to lower level structures, additional target schema constraints must be introduced, such as referential integrity c...
متن کاملAn E cient Compiler for Weighted Rewrite Rules
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as nite-state transducers (FSTs). We describe a new algorithm for compiling rewrite rules into FSTs. We show the algorithm to be simpler and more eecient than existing algorithms. ...
متن کامل